The Existence of FrGBT D(4, g u )′ s
نویسندگان
چکیده
If the blocks of a G DD(X,G,A) with block size 4, index 3 and type gu can be arranged into a (gu)/4 × (gu) array, such that: (1) the main diagonal consists of u empty subarrays of size g/4× g; (2) the blocks in each column form a partition of X\G for some G ∈ G, while the blocks in each row contains every element of X\G 3 times and no element of G for some G ∈ G, then the design is called a frame generalized balanced tournament design and denoted by FrG BT D(4, gu). The necessary conditions for the existence of such a design are u ≥ 6 and g ≡ 0(mod 4). In this paper, the sufficiency of these conditions is proved with some possible exceptions.
منابع مشابه
Solving fractional evolution problem in Colombeau algebra by mean generalized fixed point
The present paper is devoted to the existence and uniqueness result of the fractional evolution equation $D^{q}_c u(t)=g(t,u(t))=Au(t)+f(t)$ for the real $qin (0,1)$ with the initial value $u(0)=u_{0}intilde{R}$, where $tilde{R}$ is the set of all generalized real numbers and $A$ is an operator defined from $mathcal G$ into itself. Here the Caputo fractional derivative $D^{q}_c$ is used i...
متن کاملOn exponential domination and graph operations
An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....
متن کاملNew conditions on ground state solutions for Hamiltonian elliptic systems with gradient terms
This paper is concerned with the following elliptic system:$$ left{ begin{array}{ll} -triangle u + b(x)nabla u + V(x)u=g(x, v), -triangle v - b(x)nabla v + V(x)v=f(x, u), end{array} right. $$ for $x in {R}^{N}$, where $V $, $b$ and $W$ are 1-periodic in $x$, and $f(x,t)$, $g(x,t)$ are super-quadratic. In this paper, we give a new technique to show the boundedness of Cerami sequences and estab...
متن کاملThe metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملThe convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 30 شماره
صفحات -
تاریخ انتشار 2014